﻿//https://www.nowcoder.com/practice/bd891093881d4ddf9e56e7cc8416562d?tpId=182&tqId=34785&ru=/exam/oj

#include <iostream>
#include <string>
using namespace std;

string Find(const string& input) {
    int max_length = 0;
    int max_start = 0;
    int max_end = 0;
    int start = 0;
    for (int i = 0; i <= input.size(); i++) {
        if (isdigit(input[i])) {
            if (i == input.size() || !isdigit(input[i + 1])) {
                int length = i - start + 1;
                if (length > max_length) {
                    max_length = length;
                    max_start = start;
                    max_end = i + 1;
                }
            }
        }
        else {
            start = i + 1;
        }
    }
    return input.substr(max_start, max_length);
}

int main() {
    string str;
    while (cin >> str) { 
        cout << Find(str) << endl;
    }
}


//https://www.nowcoder.com/practice/0c9664d1554e466aa107d899418e814e?tpId=196&tqId=37167&ru=/exam/oj

class Solution
{
public:
    int solve(vector<vector<char>>& grid)
    {
        int ret = 0; // 记录最终结果
        int m = grid.size(), n = grid[0].size();
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                if (grid[i][j] == '1')
                {
                    ret++; // 发现⼀个岛屿
                    dfs(grid, i, j); // 把这个岛屿全部修改成 '0'
                }
            }
        }
        return ret;
    }
    int dx[4] = { 0, 1, -1, 0 };
    int dy[4] = { 1, 0, 0, -1 };
    void dfs(vector<vector<char>>& grid, int i, int j)
    {
        grid[i][j] = '0'; // 把该位置先变成 '0'
        int m = grid.size(), n = grid[0].size();
        // 遍历相邻的所有位置
        for (int k = 0; k < 4; k++)
        {
            int x = i + dx[k], y = j + dy[k];
            if (x >= 0 && x < m && y >= 0 && y < n && grid[x][y] == '1')
                dfs(grid, x, y);
        }
    }
};


//https://ac.nowcoder.com/acm/problem/219046

#include <iostream>
#include <algorithm>
using namespace std;
int t;
int arr[6];
int main()
{
    cin >> t;
    while (t--)
    {
        for (int i = 0; i < 6; i++) cin >> arr[i];
        sort(arr, arr + 6);
        if (arr[0] + arr[1] > arr[2] && arr[3] + arr[4] > arr[5] ||
            arr[0] + arr[2] > arr[3] && arr[1] + arr[4] > arr[5] ||
            arr[0] + arr[3] > arr[4] && arr[1] + arr[2] > arr[5] ||
            arr[0] + arr[4] > arr[5] && arr[1] + arr[2] > arr[3]) {
            cout << "Yes" << endl;
        }
        else cout << "No" << endl;
    }
    return 0;
}